Randomized local search, evolutionary algorithms, and the minimum spanning tree problem
نویسندگان
چکیده
منابع مشابه
Randomized Local Search, Evolutionary Algorithms, and the Minimum Spanning Tree Problem
Randomized search heuristics, among them randomized local search and evolutionary algorithms, are applied to problems whose structure is not well understood, as well as to problems in combinatorial optimization. The analysis of these randomized search heuristics has been started for some well-known problems, and this approach is followed here for the minimum spanning tree problem. After motivat...
متن کاملEvolutionary Algorithms, Randomized Local Search, and the Maximum Matching Problem
The design and analysis of problem-specific algorithms for combinatorial optimization problems is a well-studied subject. It is accepted that randomization is a powerful concept for theoretically and practically efficient problem-specific algorithms. Randomized search heuristics like randomized local search, tabu search, simulated annealing, and variants of evolutionary algorithms can be combin...
متن کاملGreedy Randomized Adaptive Search and Variable Neighbourhood Search for the minimum labelling spanning tree problem
This paper studies heuristics for the minimum labelling spanning tree (MLST) problem. The purpose is to find a spanning tree using edges that are as similar as possible. Given an undirected labelled connected graph, the minimum labelling spanning tree problem seeks a spanning tree whose edges have the smallest number of distinct labels. This problem has been shown to be NP-hard. A Greedy Random...
متن کاملHeuristic Algorithms for the Generalized Minimum Spanning Tree Problem
We consider a generalization of the classical minimum spanning tree problem called the generalized minimum spanning tree problem and denoted by GMST problem. The aim of this paper is to present an exact exponential time algorithm for the GMST problem as well three heuristic algorithms, two of them based on Prim’s and Kruskal’s algorithms for the minimum spanning tree problem and one based on th...
متن کاملStudy Morphology of Minimum Spanning Tree Problem and Generalized Algorithms
In this paper, we study the form over the minimum spanning tree problem (MST) from which we will derive an intuitively generalized model and new methods with the upper bound of runtimes of logarithm. The new pattern we made has taken successful to better equilibrium the benefits of local and global when we employ the strategy of divide and conquer to optimize solutions on problem. Under new mod...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2007
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2006.11.002